Graph Algorithm Animation with Grrr
نویسندگان
چکیده
We discuss geometric positioning, highlighting of visited nodes and user defined highlighting that form the algorithm animation facilities in the Grrr graph rewriting programming language. The main purpose of animation was initially for the debugging and profiling of Grrr code, but recently it has been extended for the purpose of teaching algorithms to undergraduate students. The animation is restricted to graph based algorithms such as graph drawing, list manipulation or more traditional graph theory. The visual nature of the Grrr system allows much animation to be gained for free, with no extra user effort beyond the coding of the algorithm, but we also discuss user defined animations, where custom algorithm visualisations can be explicitly defined for teaching and demonstration purposes.
منابع مشابه
A Graph Rewriting Programming Language for Graph Drawing
This paper describes Grrr, a prototype visual graph drawing tool. Previously there were no visual languages for programming graph drawing algorithms despite the inherently visual nature of the process. The languages which gave a diagrammatic view of graphs were not computa-tionally complete and so could not be used to implement complex graph drawing algorithms. Hence current graph drawing tools...
متن کاملA Demonstration of the Grrr Graph Rewriting Programming Language
This paper overviews the graph rewriting programming language, Grrr. The serial graph rewriting strategy is detailed, and key elements of the user interface are described. The system is illustrated by a simple example.
متن کاملReal-time Light Animation
Light source animation is a particularly hard field of real-time global illumination algorithms since moving light sources result in drastic illumination changes and make coherence techniques less effective. However, the animation of small (point-like) light sources represents a special but practically very important case, for which the reuse of the results of other frames is possible. This pap...
متن کاملInteractive buildup of animation sequences with captured motion data
We present a new approach to interactive resequencing of captured motion data that allows the user to progressively extend his/her animations such that each extension can best fit user requirements with respect to space, time, and pose. In the preprocessing phase, captured frames are clustered into pose groups, and inter-connected into a transition graph. For each step in building an animation ...
متن کاملInteractive, Tree-Based Graph Visualization
We introduce an interactive graph visualization scheme that allows users to explore graphs by viewing them as a sequence of spanning trees, rather than the entire graph all at once. The user determines which spanning trees are displayed by selecting a vertex from the graph to be the root. Our main contributions are a graph drawing algorithm that generates meaningful representations of graphs us...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1999